Root Vertex Valency Distributions of Rooted Maps and Rooted Triangulations
نویسندگان
چکیده
منابع مشابه
Generating Rooted Triangulations with Minimum Degree Four
A graph is a triangulation if it is planar and every face is a triangle. A triangulation is rooted if the external triangular face is labelled. Two rooted triangulations with the same external face labels are isomorphic if their internal vertices can be labelled so that both triangulations have identical edge lists. In this article, we show that in the set of rooted triangulations on n points w...
متن کاملEnumerative Properties of Rooted Circuit Maps
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar graphs share many interesting properties which are not satisfied by general 2-connected planar graphs. Circuit graphs have nice closure properties which make them easier to deal with than 3-connected planar graphs for s...
متن کاملCommon Edges in Rooted Trees and Polygonal Triangulations
Rotation distance between rooted binary trees measures the degree of similarity of two trees with ordered leaves and is equivalent to edge-flip distance between triangular subdivisions of regular polygons. There are no known polynomial-time algorithms for computing rotation distance. Existence of common edges makes computing rotation distance more manageable by breaking the problem into smaller...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملAlmost All Rooted Maps Have Large Representativity
Let M be a map on a surface S. The edge-width of M is the length of a shortest non-contractible cycle of M . The face-width (or, representativity) of M is the smallest number of intersections a noncontractible curve in S has with M . (The edge-width and face-width of a planar map may be de ned to be in nity.) A map is an LEW-embedding if its maximum face valency is less than its edge-width. For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1994
ISSN: 0195-6698
DOI: 10.1006/eujc.1994.1050